Blocking Probabilities for Connecting Networks Allowing Rearrangements

نویسنده

  • Frank Kwangming Hwang
چکیده

We consider connecting networks in which we allow existing calls to be rearranged (rerouted) to accommodate a new call. This capability exists, for example, in the network of the recently proposed automatic main distribution frame [2,3,4] (where the need for switching live calls does not arise). For pract~cal reasons, we are particularly interested in networks in which we allow a fixed small number, say t, of calls to be rearranged. The probability that a (random) new call is still blocked even allowing t-l rearrangements is defined as the tth_ trial-blocking probability. When t is unlimited, then the network is said to allow total rearranging. If a network can accommodate any new call under total rearranging, it is said to be rearrangeable. In this paper, we propose a model for computing the tth_ trial-blocking probability recursively for the multi-stage Clos network. The computational complexity of this model is discussed and approximations suggested. We also give various modifications of this model to fit particular net works and possible extensions to more general networks. Finally, some simulation results and computer implementations of this model are mentioned.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Two-Threshold Guard Channel Scheme for Minimizing Blocking Probability in Communication Networks

In this paper, we consider the call admission problem in cellular network with two classes of voice users. In the first part of paper, we introduce a two-threshold guard channel policy and study its limiting behavior under the stationary traffic. Then we give an algorithm for finding the optimal number of guard channels. In the second part of this paper, we give an algorithm, which minimizes th...

متن کامل

Rearranging Algorithms for Log 2 ( N , 0 , p ) Switching Networks with Even Number of Stages

In this paper we consider the rearrangeable multi-plane banyan-type switching fabrics, called also log, (N, 0, p) switching networks, with even number of stages. For such networks different rearranging algorithms have been proposed for both: one-at-a-time and simultaneous connection models. In this paper we consider the oneat-a-time connection model, where connections arrive to the system one-b...

متن کامل

An Exact Algorithm for Calculating Blocking Probabilities in Multicast Networks

The paper deals with tree-structured point-to-multipoint networks, where users from infinite user populations at the leaf nodes subscribe to a variety of channels, offered by one source. The users joining the network form dynamic multicast connections that share the network resources. An exact algorithm for calculating end-to-end call blocking probabilities for dynamic connections is devised fo...

متن کامل

Transient handover blocking probabilities in road covering cellular mobile networks

This paper investigates handover and fresh call blocking probabilities for subscribers moving along a road in a traffic jam passing through consecutive cells of a wireless network. It is observed and theoretically motivated that the handover blocking probabilities show a sharp peak in the initial part of a traffic jam roughly at the moment when the traffic jam starts covering a new cell. The th...

متن کامل

Differentiated Admission Control in Large Networks

This paper proposes a simple but effective admission control algorithm for integrated services packet networks. The admission control scheme, based on stochastic control, aims at ensuring user discrimination, by enforcing different call blocking probabilities. The queueing behavior of reservations is analytically characterized in the absence of admission control. From this, call blocking probab...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011